EQUILIBRIUM TRAFFIC ASSIGNMENT ON A NETWORK WITH CONGESTED FLOWS
نویسندگان
چکیده
منابع مشابه
Task Assignment Based on Prioritising Traffic Flows
We consider the issue of task assignment in a distributed system under heavy-tailed (ie. highly variable) workloads. A new adaptable approach called TAPTF (Task Assignment based on Prioritising Traffic Flows) is proposed, which improves performance under heavy-tailed workloads for certain classes of traffic. TAPTF controls the influx of tasks to each host, enables service differentiation throug...
متن کاملA Dynamic Traffic Assignment Model for Highly Congested Urban Networks
The management of severe congestion in complex urban networks calls for dynamic traffic assignment (DTA) models that can replicate real traffic situations with long queues and spillbacks. DynaMIT-P, a mesoscopic traffic simulation system, was enhanced and calibrated to capture the traffic characteristics in the city of Beijing, China. All demand and supply parameters were calibrated simultaneou...
متن کاملBi-Objective Network Equilibrium, Traffic Assignment and Road Pricing
Multi-objective equilibrium models of traffic assignment state that users of road networks travel on routes that are efficient with respect to several objectives, such as travel time and toll. This concept provides a general framework for modelling traffic flow in tolled road networks. We present the concept of time surplus maximisation as a way of handling user preferences. Given a toll, users...
متن کاملCritical Enhancements of a Dynamic Traffic Assignment Model for Highly Congested, Complex Urban Network
To accurately replicate the highly congested traffic situation of a complex urban network, significant challenges are posed to current simulation-based dynamic traffic assignment (DTA) models. This thesis discusses these challenges and corresponding solutions with consideration of model accuracy and computational efficiency. DynaMITP, an off-line mesoscopic DTA model is enhanced. Model success ...
متن کاملCongested traffic dynamics, weak flows and very degenerate elliptic equations
Starting from a model of traffic congestion, we introduce a minimal-flow–like variational problem whose solution is characterized by a very degenerate elliptic PDE. We precisely investigate the relations between these two problems, which can be done by considering some weak notion of flow for a related ODE. We also prove regularity results for the degenerate elliptic PDE, which enables us in so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFRASTRUCTURE PLANNING REVIEW
سال: 1986
ISSN: 0913-4034,1884-8303
DOI: 10.2208/journalip.3.177